Space-time block codes with low maximum-likelihood decoding complexity
نویسنده
چکیده
منابع مشابه
On"A Novel Maximum Likelihood Decoding Algorithm for Orthogonal Space-Time Block Codes"
Abstract The computational complexity of the Maximum Likelihood decoding algorithm in [1], [2] for orthogonal space-time block codes is smaller than specified.
متن کاملA new lattice decoding for space time block codes with low complexity
We present an algorithm based on the closest point search (CPS) in lattices for decoding of space-time block codes (STBC). The modified CPS algorithm based on the Schnorr-Euchner variation of the Pohst method is used to perform the decoding of STBC. This method is shown to be substantially faster than other known sphere decoding methods. Also we exploit a fast method for decoding of orthogonal ...
متن کاملFast Algorithm for Generating Candidate Codewords in Reliability-Based Maximum Likelihood Decoding
We consider the reliability-based heuristic search methods for maximum likelihood decoding, which generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Some studies have proposed methods for reducing the space complexity of these algorithms, which is crucially large for long block codes at medium to low signal to noise ratios of the channel. I...
متن کاملA Novel Maximum Likelihood Detection Algorithm for Orthogonal Space-Time Block Codes
In this letter, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal space-time block codes (OSTBCs) based on the real-valued lattice representation and QR decomposition. We show that for a system with rate r = K/T , where K is the number of transmitted symbols per T time slots, the proposed algorithm decomposes the original complex-valued system into a parallel...
متن کاملMaximum Mutual Information of Space-Time Block Codes with Symbolwise Decodability
In this paper, we analyze the performance of space-time block codes which enable symbolwise maximum likelihood decoding. We derive an upper bound of maximum mutual information (MMI) on space-time block codes that enable symbolwise maximum likelihood decoding for a frequency non-selective quasi-static fading channel. MMI is an upper bound on how much one can send information with vanishing error...
متن کامل